- 原文:Sangria: a Folding Scheme for PLONK
- 作者:Nicolas Mohnblatt
- 译者:Kurt Pan
As shown in Nova [KST22], incrementally verifiable computation (IVC) can be realised using a folding scheme and a zkSNARK. In this article, we present a folding scheme for a variant of the PLONK arithmetization [GWC19]. We then extend our relaxed PLONK arithmetization to accept custom gates of degree 2 and circuits with higher gate arity. Finally we outline avenues for future work including folding higher degree gates, supporting lookup gates and designing an IOP for the relaxed PLONK arithmetization.
如 Nova [KST22] 所示,可以使用折叠方案和 zkSNARK 实现增量可验证计算 (IVC)。 在本文中,我们提出了 PLONK 算术 [GWC19] 变体的折叠方案。 然后,我们扩展我们的轻松 PLONK 算术,以接受 2 次自定义门和具有更高门数的电路。 最后,我们概述了未来工作的途径,包括折叠更高阶的门、支持查找门和为轻松的 PLONK 算术设计 IOP。